MUESLI - a Material UnivErSal LIbrary
نویسندگان
چکیده
Simulation codes in Computational Mechanics employ libraries of materials that model their constitutive response. At the same time, many researchers and code developers in this discipline continue to implement their own advanced material models. However, to the best of the authors’ knowledge, there is no way to access this body of knowledge and accumulated experience since computer implementations of material models are not shared. Muesli, a Material UnivErSal LIbrary, is an open source library created to alleviate this situation, simplifying the development and implementation of material models, and their interface with larger research and comercial computational codes. Muesli has several features that make it appealing for users and developers in Computational Mechanics: Programmed in high-level C++, it defines vector and tensors classes that are later employed to simplify and speed up as much as possible the formulation of new materials. The library is structured in material families, each of them possessing a clear interface and automatic checking capabilities that verify, to a certain extent, the correctness of the implementation. The library already includes the most commonly employed material models for small strain and finite strain solids, thermal analysis, and simple fluids. The library has interfaces to two commercial codes, and more will be developed, so that exactly the same code can be re-used in research and commercial programs. It can be freely obtained from http://www.materials.imdea.org/Muesli In the poster we will present the main features of the library and the potential advantages for those who decide to include it in their projects.
منابع مشابه
Parallelizing the LM OSEM Image Reconstruction on Multi-Core Clusters
In this paper we present four different parallel implementations of the popular LM OSEM medical image reconstruction algorithm. While two of them use libraries such as MPI, OpenMP, or Threading Building Blocks (TBB) directly, the other two implementations use algorithmic skeletons of the Münster Skeleton Library Muesli to hide the parallelism. We compare the implementations w.r.t. runtime, effi...
متن کاملAlgorithmic skeletons for branch & bound
Algorithmic skeletons are predefined components for parallel programming. We will present a skeleton for branch & bound problems for MIMD machines with distributed memory. This skeleton is based on a distributed work pool. We discuss two variants, one with supply-driven work distribution and one with demanddriven work distribution. This approach is compared to a simple branch & bound skeleton w...
متن کاملUvA-DARE (Digital Academic Repository) Universal rescaling of flow curves for yield-stress fluids close to jamming Dinkgreve,
Disclaimer/Complaints regulations If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library: http://uba.uva.nl/en/contact, or a letter to: Library of ...
متن کاملExploiting Training Example Parallelism with a Batch Variant of the Art 2 Classification Algorithm
In this article we develop a batch variant of the ART 2 classification algorithm invented by Carpenter and Grossberg. Our algorithm exploits training example parallelism while leaving the overall design of the ART 2 network unchanged such that a significant reduction of the execution time can be achieved on a multiprocessor system. We present a parallel implementation strategy and analyze it w....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Advances in Engineering Software
دوره 105 شماره
صفحات -
تاریخ انتشار 2017